perm filename MSG.MSG[JNK,JMC]1 blob
sn#692383 filedate 1982-12-22 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00058 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00009 00002 ∂11-Nov-82 2002 Jeffrey D. Ullman <CSD.ULLMAN at SU-SCORE> Who owes whom for what
C00012 00003 ∂12-Nov-82 0927 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00016 00004 ∂12-Nov-82 0935 CLT MTC and FORMAL SYSTEMS SEMINAR
C00020 00005 ∂12-Nov-82 1748 Paul Armer <CSD.ARMER at SU-SCORE> Forsythe Lectures
C00021 00006 ∂14-Nov-82 1911 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00026 00007 ∂14-Nov-82 1926 reid@Shasta (SuNet) mailing list and committee duties
C00029 00008 ∂14-Nov-82 1957 lantz@Diablo (SuNet) Re: mailing list and committee duties
C00030 00009 ∂14-Nov-82 2149 reid@Shasta (SuNet) Re: mailing list and committee duties
C00034 00010 ∂14-Nov-82 2150 pratt@Navajo (SuNet) Re: mailing list and committee duties
C00039 00011 ∂14-Nov-82 2152 reid@Shasta (SuNet) Re: mailing list and committee duties
C00041 00012 ∂16-Nov-82 0847 Joe Oliger <oliger at Navajo> Re: Lunch on Tuesday
C00043 00013 ∂16-Nov-82 0854 Keith Lantz <lantz at Diablo> Winter Colloquium
C00044 00014 ∂16-Nov-82 0859 golub at Navajo Lunch on Tuesday
C00046 00015 ∂16-Nov-82 1731 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 22 - 26,1982
C00048 00016 ∂16-Nov-82 2348 Arthur Keller <CSD.KELLER at SU-SCORE> Surprise Party for Ullman
C00049 00017 ∂17-Nov-82 2100 CSCHMIDT at SUMEX-AIM 3600
C00050 00018 ∂18-Nov-82 1043 Irmgild Schack <CSD.IRMGILD at SU-SCORE> Tenure
C00052 00019 ∂18-Nov-82 1101 Gene Golub <CSD.GOLUB at SU-SCORE> Teaching responsibilities
C00055 00020 ∂18-Nov-82 1226 Joe Oliger <oliger at Navajo> Re: Teaching responsibilities
C00056 00021 ∂18-Nov-82 1238 CSCHMIDT at SUMEX-AIM Chaosnet progress report
C00058 00022 ∂18-Nov-82 1707 Doug Lenat <CSD.LENAT at SU-SCORE> Gene's note about tenure policy
C00060 00023 ∂18-Nov-82 2005 pratt at Navajo Tenure
C00062 00024 ∂19-Nov-82 1025 CLT SPECIAL SEMINAR
C00063 00025 ∂19-Nov-82 1657 Irmgild Schack <CSD.IRMGILD at SU-SCORE> Exchange Program for Students
C00065 00026 ∂22-Nov-82 2015 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00074 00027 ∂22-Nov-82 2133 Gene Golub <CSD.GOLUB at SU-SCORE> Reminder
C00075 00028 ∂23-Nov-82 0905 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00076 00029 ∂23-Nov-82 1202 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 29 - DECEMBER 3, 1982
C00079 00030 ∂24-Nov-82 1002 Paul Armer <CSD.ARMER at SU-SCORE> Advisory Committee Agenda
C00080 00031 ∂24-Nov-82 1028 pratt at Navajo Advisory committee
C00082 00032 ∂24-Nov-82 1040 Paul Armer <CSD.ARMER at SU-SCORE> Re: Advisory committee
C00084 00033 ∂24-Nov-82 1058 Vaughan Pratt <pratt at Navajo> Re: Advisory committee
C00086 00034 ∂27-Nov-82 0933 CLT MTC and FORMAL SYSTEMS SEMINAR
C00087 00035 ∂28-Nov-82 1815 Gene Golub <CSD.GOLUB at SU-SCORE> Kahan Colloquium
C00088 00036 ∂29-Nov-82 0130 Arthur Keller <ARK at SU-AI> Potluck This Saturday
C00090 00037 ∂29-Nov-82 1420 Paul Armer <CSD.ARMER at SU-SCORE> The President's Advisory Committee on Computer Science and
C00092 00038 ∂29-Nov-82 1532 CSCHMIDT at SUMEX-AIM Chaosnet
C00094 00039 ∂29-Nov-82 1746 Gene Golub <CSD.GOLUB at SU-SCORE> Meeting with Wessells and Quate
C00095 00040 ∂30-Nov-82 2153 Gene Golub <CSD.GOLUB at SU-SCORE> meeting on Thursday
C00096 00041 ∂30-Nov-82 2220 Gene Golub <CSD.GOLUB at SU-SCORE> Cedar Hall
C00097 00042 ∂01-Dec-82 1504 Gene Golub <CSD.GOLUB at SU-SCORE> Cocktail Party
C00098 00043 ∂02-Dec-82 0928 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF DECEMBER 6 - 10, 1982
C00101 00044 ∂02-Dec-82 2358 Joan Feigenbaum <CSD.JF at SU-SCORE> course evaluations
C00103 00045 ∂04-Dec-82 1139 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00104 00046 ∂05-Dec-82 2048 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00108 00047 ∂06-Dec-82 1149 Gene Golub <CSD.GOLUB at SU-SCORE> Lunch on 12/7/82
C00109 00048 ∂06-Dec-82 1354 CLT MTC and FORMAL SYSTEMS SEMINAR
C00113 00049 ∂06-Dec-82 1401 CLT SPECIAL MTC and FORMAL SYSTEMS SEMINAR
C00114 00050 ∂07-Dec-82 1607 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF DECEMBER 13 - 17, 1982
C00116 00051 ∂08-Dec-82 1230 Paul Armer <CSD.ARMER at SU-SCORE> Space in Cedar Hall
C00117 00052 ∂08-Dec-82 0941 Chappell at SRI-AI TINLUNCH on Friday
C00121 00053 ∂09-Dec-82 2204 Gene Golub <CSD.GOLUB at SU-SCORE> Genesereth appointment
C00122 00054 ∂12-Dec-82 0222 pratt at Navajo Potluck
C00129 00055 ∂17-Dec-82 0933 Chappell at SRI-AI 1982 Last TINLUNCH
C00131 00056 ∂20-Dec-82 0941 Aaai-Office at SUMEX-AIM IJCAI and AAAI Proceedings
C00133 00057 ∂21-Dec-82 0849 CSCHMIDT at SUMEX-AIM [The Mailer Daemon <Mailer at SUMEX-AIM>: Message of 16-Dec-82 14:53:36]
C00135 00058 ∂21-Dec-82 1024 Aaai-Office at SUMEX-AIM Two Notes
C00137 ENDMK
C⊗;
∂11-Nov-82 2002 Jeffrey D. Ullman <CSD.ULLMAN at SU-SCORE> Who owes whom for what
Date: 11 Nov 1982 2001-PST
From: Jeffrey D. Ullman <CSD.ULLMAN at SU-SCORE>
Subject: Who owes whom for what
To: csd.faculty at SU-SCORE
cc: csd.bscott at SU-SCORE
While I missed the Tuesday lunch, I understand there was some
question about whether or not CSD earns a profit for the
university. I think the following calculation can shed
some light.
CSD COST
We are about 20 faculty, or 1.3% of the university.
That 1.3% is probably a fair estimate of the fraction of
the common resources we consume. The university budget
is on the order of $200M (I think). Therefore our share
is about 3.6M. That covers building, utilities, administration,
everything.
CSD INCOME TO UNIVERSITY
1. The overhead we generate is about 40% of 8M, or 3.2M.
2. We generate tuition income. The number of students or equivalent,
whose tuition we can rightly claim accrues to the university
primarily because of our efforts is
a. 200 grad students.
b. about 60 Juniors and Seniors in Math Sci. or other
programs who are primarily acting as CS majors.
c. 1/12 of the roughly 1200 underclass students who take
our introductory courses each year.
Therefore, we generate the tuition income from about 360 students,
which at 8K per is 2.9M.
3. 0.2M research salary offset.
The total income is therefore something like 6.3M, for a cool
2.7M/year profit by the university.
That doesn't even include income from licensing agreements,
or gifts to the department. There is also an intangible effect
on the university's annual gift total due to the quality
of CSD.
-------
∂12-Nov-82 0927 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]" at SU-AI
Speaker: Dr. J. A. Goguen, SRI International
Time: Monday, November 15, 3:30-5:00
Place: Room 383N Math. Bldg.
Title: INSTITUTIONS: Abstract Model Theory and Program Specification (cntd.)
∂12-Nov-82 0935 CLT MTC and FORMAL SYSTEMS SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. November 17, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Kamran Parsaye
Higher Order Abstract Data Types
Kamran Parsaye
Hewlett Packard Laboratories
Joseph Goguen
SRI International
A higher order operation is an operation which either accepts another
operation as an argument or which returns an operation as a result, or both.
We present a theory of higher order abstract data types based on a theory of
higher order universal algebra which provides adequate semantics by providing
a model theory with an appropriate equational proof theory and a completeness
theorem.
An algebraic theory of the typed lambda-calculus is presented in
terms of higher order equational theories. We prove that a cartesian closed
category is "exactly" the structure needed for higher order equational theories.
In distinct contrast to Scott's denotational order theoretic approach,
we define higher order algebras in terms of "definability" of function spaces.
The existance of higher order initial algebras is proved and "complete" rules
for higher order equational deduction are presented.
Coming Events:
Wednesday November 24 pre-turkey day holiday
Wednesday November 31 Jim Mcdonald
Wednesday December 7 Pepe Meseguer, on OBJ
∂12-Nov-82 1748 Paul Armer <CSD.ARMER at SU-SCORE> Forsythe Lectures
Date: 12 Nov 1982 1618-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Forsythe Lectures
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
Gene recently asked for nominations for the 1l984 Forsythe Lectures,
referring you to a file of our alumni. If you had trouble reading
that file, try instead <csd.files>alumni.pty.
Paul
-------
∂14-Nov-82 1911 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 14 Nov 1982 1817-PST
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
T H E N E X T A F L B - T A L Ks
11/18/82 Harry Mairson (Stanford):
"The program complexity of searching a table"
Given a fixed set S of n keys, we would like to store them so that
queries of the form ``Is x in S?'' can be answered quickly. A
commonly employed scheme to solve this problem uses a table to store
the keys, and a special purpose program depending on S which probes
the table. We analyze the tradeoff between the maximum number of
probes allowable to answer a query, and the length of the program to
do so. Perfect Hashing (where the query must be answered in one
probe) has a program complexity of (n lg e)(1+o(1)) bits, and this
lower bound can be achieved. Under a somewhat restricted model it is
shown that for t probes to the table, (nt)/(2↑(t+1))(1+o(1)) bits are
necessary and sufficient to describe a table searching algorithm.
Some models where pointers are allowed in the table are also analyzed.
In addition, we prove some lower bounds on the worst-case behavior of
universal classes of hash functions.
******** Time and place: Nov. 18, 12:30pm in MJ352 (Bldg. 460) ********
11/25/82 HAPPY THANKSGIVING !!!
12/2/82 Dr. Maria Klawe (IBM Research San Jose):
"Alphabetic minimax trees"
This talk concerns the following problem. Given vertices
v(1),...,v(n) with weights w(1),...,w(n), construct a t-ary tree with
leaves v(1),...,v(n) in left to right order, such that if l(i) denotes
the length of the path from v(i) to the root for each i, the maximum
of w(i) + l(i) is minimized. A linear algorithm is presented for the
case that all the weights are integers, and this is used to obtain an
O(n log n) algorithm for the case of general weights. This result has
applications in the study of the effect of fan-out constraints in
logical circuits.
******** Time and place: Dec. 2, 12:30pm in MJ352 (Bldg. 460) ********
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this year have been
filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
∂14-Nov-82 1926 reid@Shasta (SuNet) mailing list and committee duties
Date: Sunday, 14 Nov 1982 19:26-PST
To: Admissions at Shasta
Subject: mailing list and committee duties
In-reply-to: Your message of 12 Nov 1982 1732-PST.
From: Brian Reid <reid at Shasta>
I have set up the mailing list Admissions@Shasta, which can be mailed
to from anywhere on the Arpanet, and which keeps a logfile on Shasta.
I would like to make sure that all of the volunteers for the admissions
committee understand what they are getting themselves in for. The
admissions process is fairly sleepy until February, but from February 1
until about March 15, you are going to have to be able to put in 20
hours a week on reading folders. If you have reason to believe that you
are not going to be able to put that kind of energy and commitment into
admissions during February and early March, then you should probably
not be on the committee. It is especially vital that you be able to do
a responsible job of reading all 50-70 Round II folders during the
first week of March, and that you be able to attend the entire Round II
meeting (tentatively scheduled for Friday afternoon March 11).
Tentatively, the milestones in the admissions process are these:
February 1 (Tues) 1:30-->5:00 introductory meeting
during February each person will read about 20 folders every 4 days.
March 1 (Tues) 1:30-->however long it takes: Round 1 meeting
First week of march each person reads all 50-70 Round II folders.
March 11 (Fri) 1:30-->however long it takes: Round 2 meeting
I don't mean to sound ominous by this note, but each past year that I
have been on the committee, there was at least one person who hadn't
realized what kind of work he was getting himself in for, and as a
result did not do the best job that he could have.
Brian
∂14-Nov-82 1957 lantz@Diablo (SuNet) Re: mailing list and committee duties
Mail-from: SU-NET host Diablo rcvd at 14 Nov 1982 19:58:36-PST
Date: Sunday, 14 Nov 1982 19:56-PST
To: Admissions at Shasta
Subject: Re: mailing list and committee duties
In-reply-to: Your message of Sunday, 14 Nov 1982 19:26-PST.
From: Keith Lantz <lantz at Diablo>
I am stunned that this or any committee should require 20 hours/week
for 6 weeks. I find such a figure ominous indeed. Would anyone else
care to offer a different estimate?
Keith
∂14-Nov-82 2149 reid@Shasta (SuNet) Re: mailing list and committee duties
Date: Sunday, 14 Nov 1982 20:25-PST
To: Keith Lantz <lantz at Diablo>
Cc: Admissions at Shasta
Subject: Re: mailing list and committee duties
In-reply-to: Keith Lantz's message of Sunday, 14 Nov 1982 19:56-PST.
From: Brian Reid <reid at Shasta>
Admissions is a big job. Let's look at the numbers. We expect 300 to
400 applicants (I think that last year we had about 360 completed
applications, if I recall the numbers correctly). Let's say 300, just
to be conservative. During round 1, every folder is read by 2 members
of the committee. There are 7 members, so each person's share is 2/7ths
of 300, which is 85 folders. In addition to those 85, any folder being
proposed for early decision must be read by the entire committee; that
usually amounts to about 10 more, for a total of maybe 90 or 95 folders
per person.
To do a responsible job of evaluating a folder takes anywhere from half
an hour to an hour, depending on whether you can read the handwriting
in the letters of recommendation, and whether you are familiar with
that university's transcript and grading scheme, and whether the
statement of purpose is long or short. I found that I spent as little
as 20 minutes on some folders and as long as an hour on others. Let's
assume that I am unusually slow and that most people can read and
evaluate a folder in half an hour. That amounts to 45 hours spent
reading folders. That's 11 hours a week if you take half an hour per
folder. I found that I spent more than that, and further that I spent
an hour or two a week on other admissions things besides reading
folders, such as discussions of evaluation criteria, going back and
re-reading folders that I had read earlier in the process to make sure
that my evaluations were not imperceptibly changing in time. The
meetings themselves chew up 5 to 6 hours.
Spending 45+(1.5*4)+6 hours in a month comes to only 15 hours a week; I
said 20. Maybe I spent the extra 5 hours a week trudging back and forth
from ERL to Jacks, or reading mail about admissions, or helping make
sure that the statistical analysis programs were right.
In any event, it's a huge time commitment, and furthermore it is
crucial that one be able to return each batch of folders on schedule,
in order that the circulation keeps working properly.
Brian
∂14-Nov-82 2150 pratt@Navajo (SuNet) Re: mailing list and committee duties
Mail-from: SU-NET host Navajo rcvd at 14 Nov 1982 21:29:26-PST
Date: Sunday, 14 Nov 1982 21:29-PST
To: Keith Lantz <lantz at Diablo>
Cc: Admissions at Shasta
Subject: Re: mailing list and committee duties
In-reply-to: Your message of Sunday, 14 Nov 1982 19:56-PST.
From: Vaughan Pratt <pratt at Navajo>
Yes, I have quite a different set of numbers that I recall from last year.
I felt I did a quite conscientious job of reading folders. For
four weeks I read 25 folders per week, my share of round I. A number of
applicants I would agonize over for quarter of an hour, many I would put in
one or the other pile in 5 minutes or less. One or two I recall giving me up
to an hour's grief. But typically I could get done in 4 to 5 hours each week,
wiping out a month of Saturday mornings (it helps psychologically to do it
right away, last year we got the folders on Friday afternoons).
Yet I put as much care into the Round I reading as would be reasonable for
Round II. One corollary of this was that the 50 Round II folders represented
roughly the equivalent of two weeks of Round I for me.
So all in all I put in at most 30 hours of homework on folder reading at home,
comparable to what a very conscientious conference program committee member
might spend at home reading papers. Whether you spend more or less depends
on how long it takes you to get a sufficiently clear picture of each
applicant to give you a solid feeling for the applicant's likely chances of
success at Stanford. You have to try it to find this out.
You can add to this about a day's worth of meetings, tracking down
information, calling students, etc.
Even so, the total work effort was a LOT more than that required for the
Comprehensive Committee last year, even given the unusually many meetings we
had for that committee. (Thank goodness. I'm on four committees this year,
if they all took 20 hours per week it would be hard to find time to eat.)
Thus the Admissions Committee is no breeze compared to other committees.
Even if the quantitative details of Brian's warning are open to question, the
qualitative aspect is quite accurate. You should realize what you're getting
into.
Brian's quantitative estimates can be better understood by noting that
last year the introductory meeting was about an hour. (If it was longer, I
must have missed some of it.) This year's is 3 1/2 hours. If you use this
ratio to scale up say a 5-hour-per-week reading effort you arrive at around
18 hours per week, close to what Brian was figuring. My theory is that all
the time estimates can be tuned up simply by moving the binary point two places
left. To paraphrase Einstein, I for one would be most appreciative if the
introductory meeting were made as short as possible but no shorter.
-v
∂14-Nov-82 2152 reid@Shasta (SuNet) Re: mailing list and committee duties
Date: Sunday, 14 Nov 1982 21:53-PST
To: Vaughan Pratt <pratt at Navajo>
Cc: Admissions at Shasta
Subject: Re: mailing list and committee duties
In-reply-to: Your message of Sunday, 14 Nov 1982 21:29-PST.
From: Brian Reid <reid at Shasta>
Actually, Vaughan, I referred back to my calendar for March 1, 1982,
and noted that there had been an admissions committee meeting scheduled
for 1:30-5:00 that day, and just copied the numbers into my mail
message. There is certainly no point in meeting for longer than
necessary. Would that I had written down how long that meeting actually
took, as opposed to the time that I was asked to allocate for it...
∂16-Nov-82 0847 Joe Oliger <oliger at Navajo> Re: Lunch on Tuesday
Mail-from: SU-NET host Navajo rcvd at 16-Nov-82 0139-PST
Date: Tuesday, 16 Nov 1982 01:39-PST
To: golub at Navajo
Cc: faculty at Score
Subject: Re: Lunch on Tuesday
In-reply-to: Your message of 15 November 1982 21:02:17-PST (Monday).
From: Joe Oliger <oliger at Navajo>
I was sorry to hear that you were ill yesterday. Here is hoping that
tomorrow is a better day.
I am sorry that I will miss lunch today. I must make a trip to Monterey
to make my research sponsors happy.
I see that you are on Navajo now. Are you using mhe? I think that it
is a great system.
Thanks for your efforts in organizing the picnic.
Best regards, Joe
∂16-Nov-82 0854 Keith Lantz <lantz at Diablo> Winter Colloquium
Mail-from: SU-NET host Diablo rcvd at 15-Nov-82 1409-PST
Date: Monday, 15 Nov 1982 14:06-PST
To: faculty at Score
Subject: Winter Colloquium
From: Keith Lantz <lantz at Diablo>
I am running the CS colloquium winter quarter and am soliciting
suggestions for speakers. Please respond with as many suggestions as
you'd like, together with any dates that you know a particular prospect
is scheduled to be in the area.
Keith
∂16-Nov-82 0859 golub at Navajo Lunch on Tuesday
Mail-from: SU-NET host Navajo rcvd at 15-Nov-82 2102-PST
Date: 15 November 1982 21:02:17-PST (Monday)
From: golub at Navajo
Subject: Lunch on Tuesday
To: faculty at score
I would like to discuss with you a number of issues.
One important point concerns the amount of time some of
the faculty spend in the department. As you recall from
Lieberman's discussion it is widely believed that some of
our faculty do not spend enough time on academic matters.
Also, Stuart Reges wants to bring up the problem of limited
enrollment.
I hope you can make this meeting. Please try to arrive around
12:15.
Next week, Bob Spinrad will return for lunch. this meeting is
especially important because it comes immediately before the Advisory
Committee visits and Bob is chairman of the advisory committee.
GENE
∂16-Nov-82 1731 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 22 - 26,1982
Date: 16 Nov 1982 1326-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: COLLOQUIUM NOTICE WEEK OF NOVEMBER 22 - 26,1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
11/22/82 Math 380C Jeffrey Saltzman
Monday Numerical Analysis Los Alamos National Lab
4:15 p.m. Seminar ``A Variational Method for Generating
Multidimensional Adaptive Grids and its
Application to 2-D Hydrodynamics''
11/23/82 MJ352 Dr.Ira Goldstein
Tuesday Medical Technology Hewlett Packard
2:30 p.m. Research Seminar ``Expert Systems Applied to Electrocadiographic
Interpretation''
11/23/82 Jordan 040 Professor Zohar Manna
Tuesday Computer Science Stanford University
4:15 p.m. Colloquium ``A Deductive Approach to Program Synthesis''
11/24/82 Terman Auditorium Martin Kays
Wednesday Computer Systems Xerox Parc
4:15 p.m. Laboratory Seminar To be Announced
WISHING YOU ALL A HAPPY HAPPY THANKSGIVING!!!!
-------
∂16-Nov-82 2348 Arthur Keller <CSD.KELLER at SU-SCORE> Surprise Party for Ullman
Date: 16 Nov 1982 2323-PST
From: Arthur Keller <CSD.KELLER at SU-SCORE>
Subject: Surprise Party for Ullman
To: CSD-Faculty-Except-Ullman: ;,
PHD-Distribution-list: ;,
staff: ;
Reply-to: ARK@SU-AI
Monday, 22 November is Jeff Ullman's 40th birthday. Come celebrate this
event in the lounge on at 4:30 on Monday.
Arthur Keller and Alan Siegel
-------
∂17-Nov-82 2100 CSCHMIDT at SUMEX-AIM 3600
Date: 17 Nov 1982 2057-PST
From: CSCHMIDT at SUMEX-AIM
Subject: 3600
To: HPP-Lisp-Machines at SUMEX-AIM
This is to let the curious know that no 3600's have been shipped
to date. The processor board design and manufacture is not complete.
No 3600's will be shipped in 1982. Stanford cannot expect to
receive a 3600 before Spring.
--Christopher
-------
∂18-Nov-82 1043 Irmgild Schack <CSD.IRMGILD at SU-SCORE> Tenure
Date: 18 Nov 1982 1030-PST
From: Irmgild Schack <CSD.IRMGILD at SU-SCORE>
Subject: Tenure
To: faculty at SU-SCORE
I had dinner with the Dean last night and several department chairmen
in H&S. There was a proposal that the tenure decision be made after
seven years rather than six as is current. The first appointment would
be made for four years, and after a hard examination a re-appointment
would be made for three years. In the second appointment, the faculty
member would be an Associate Professor, but the promootion would not
carry tenure. Any comments?
Gene.
-------
∂18-Nov-82 1101 Gene Golub <CSD.GOLUB at SU-SCORE> Teaching responsibilities
Date: 18 Nov 1982 1047-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Teaching responsibilities
To: faculty at SU-SCORE
18-Nov-82 10:41:33-PST,1343;000000000001
Mail-From: CSD.IRMGILD created at 18-Nov-82 10:17:32
Date: 18 Nov 1982 1017-PST
From: Irmgild Schack <CSD.IRMGILD at SU-SCORE>
Subject: Faculty Absences
To: csd.golub at SU-SCORE
cc: CSD.IRMGILD at SU-SCORE
I want to give some guidelines on faculty teaching responsibilities.
A faculty member can be absent from teaching for the following reasons:
a) Conference attendance
b) Government service
c) Some distinction or award
It is usually not appropriate for a class to be missed for personal
reasons or in order to collaborate on research with a colleague.
At any rate, I don't think more than 10% of the lectures should
n o t be given by the instructor. If the course is in the 100 level
a substitute instructor should be found and for advanced courses,
the lectures should be made up if a substitute lecturer can not be
found.
Some faculty members are able to reduce their teaching to two courses
per academic year. In the future years, it will not be possible to
complete one's teaching obligation in one quarter. Furthermore, in any
course the lecturer should give at least 2/3 of the lectures. A set
of invited lectures is considered a seminar and teaching credit will not
be given in this situation.
I believe these rules are fair, and I hope you will abide by them.
Gene
-------
-------
∂18-Nov-82 1226 Joe Oliger <oliger at Navajo> Re: Teaching responsibilities
Mail-from: SU-NET host Navajo rcvd at 18-Nov-82 1208-PST
Date: Thursday, 18 Nov 1982 12:08-PST
To: Gene Golub <CSD.GOLUB at SU-SCORE>
Cc: faculty at SU-SCORE
Subject: Re: Teaching responsibilities
In-reply-to: Your message of 18 Nov 1982 1047-PST.
From: Joe Oliger <oliger at Navajo>
What about absence in order to present seminars at other universities.
This doesn't seem to fall in any of your categories and is often, if not
usually, necessary if we are to give such lectures.
Joe
∂18-Nov-82 1238 CSCHMIDT at SUMEX-AIM Chaosnet progress report
Date: 18 Nov 1982 1236-PST
From: CSCHMIDT at SUMEX-AIM
Subject: Chaosnet progress report
To: HPP-Lisp-Machines at SUMEX-AIM
It is now possible to FTP to and from the LM-2 from the Diablo
end of the Chaosnet.
CFTP is the VAX program that enables you to do this. The LM-2 is
called host LM1. The name of a file on the LM-2 looks like
LM1:>schmidt>file.extension. You will be required to "login." You do not
need a password, so just type carriage return when asked.
There remain a number of problems with the servers on the VAX,
which are being worked on.
The LM-2 can't initiate transactions with the VAX for two reasons.
First, the VAX isn't in its host tables. Marc LeBrun of Symbolics will
come over tomorrow at some as-yet undetermined time and remedy that. The
second problem is the non-working servers on the VAX. Some servers work
(eg finger), but others (most notably telnet and FTP) do not.
--Christopher
-------
∂18-Nov-82 1707 Doug Lenat <CSD.LENAT at SU-SCORE> Gene's note about tenure policy
Date: 18 Nov 1982 1706-PST
From: Doug Lenat <CSD.LENAT at SU-SCORE>
Subject: Gene's note about tenure policy
To: faculty at SU-SCORE
The suggested plan is more in line with the policies of many
other universities (such as CMU and MIT), except for the part
about 7 versus 6 years. I personally would have preferred
having that extra year, rather than the earlier decision,
but I imagine each individual would feel differently.
I like the way the plan makes Associcate Professorship
a very distinct state from full professorship.
Doug
-------
∂18-Nov-82 2005 pratt at Navajo Tenure
Mail-from: SU-NET host Navajo rcvd at 18-Nov-82 2006-PST
Date: 18 November 1982 20:05:50-PST (Thursday)
From: pratt at Navajo
Subject: Tenure
To: faculty at score
Gene, could you give the proposed new schedule for tenure in more detail?
You said "decision" after seven years, but then the subsequent remarks made
it sound like "reappointment with tenure" after seven years. I'm confused
enough about the existing timetable that I can't compute the new one from it.
In the new scheme, when would the decision be made by, and by what time must
one have tenure in order to be reappointed?
-v
∂19-Nov-82 1025 CLT SPECIAL SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. November 24, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Dave Matthew, Cambridge University
TITLE: POLY
ABSTRACT:
"Poly is a general-purpose programming language with a powerful type
system, based on Russell. It allows polymorphic operations and
parameterised types as part of a generalized procedure mechanism. The talk
will describe the language, its implementation and some applications."
∂19-Nov-82 1657 Irmgild Schack <CSD.IRMGILD at SU-SCORE> Exchange Program for Students
Date: 19 Nov 1982 1603-PST
From: Irmgild Schack <CSD.IRMGILD at SU-SCORE>
Subject: Exchange Program for Students
To: su-bboards at SU-SCORE
cc: faculty at SU-SCORE
Dean Lieberman has sent out a memo outlining an exchange scholar program
for students. This enables students in the Ph.D. program in Humanities
and Sciences to study at one of the prescribed graduate schools for a
period of up to one year. Marilynn Walker has a copy of the flyer.
Gene Golub
-------
∂22-Nov-82 2015 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 22 Nov 1982 1751-PST
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
Note: Dec. 9 will be the last talk this quarter. AFLB will resume in
January.
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
T H E N E X T A F L B - T A L Ks
11/25/82 Happy Thanksgiving
12/2/82 Dr. Maria Klawe (IBM Research San Jose):
"Alphabetic minimax trees"
This talk concerns the following problem. Given vertices
v(1),...,v(n) with weights w(1),...,w(n), construct a t-ary tree with
leaves v(1),...,v(n) in left to right order, such that if l(i) denotes
the length of the path from v(i) to the root for each i, the maximum
of w(i) + l(i) is minimized. A linear algorithm is presented for the
case that all the weights are integers, and this is used to obtain an
O(n log n) algorithm for the case of general weights. This result has
applications in the study of the effect of fan-out constraints in
logical circuits.
******** Time and place: Dec. 2, 12:30pm in MJ352 (Bldg. 460) ********
9/12/82 Dr. Lyle Ramshaw (Xerox):
"Structuring a program that has GOTO statements"
A Pascal GOTO can jump either forward or backward within a block, but
a Mesa GOTO can only force an exit from a block. I recently faced the
problem of translating as many types of Pascal GOTO's as possible into
legal Mesa control structures. This problem turns out to suggest the
following puzzle, whose solution I will present.
Draw a horizontal line. Above that line, draw a collection of arrows
connecting pairs of points on the line. Any two of the arrows that
you have drawn must either: (i) be disjoint, (ii) be nested, or (iii)
intersect. Intersecting pairs of arrows are bad. Try to eliminate
them by taking any existing arrow and moving its tail in the direction
that makes the arrow longer. Remember: only tails may move, never
heads. Furthermore, the tail of a right-pointing arrow may only move
to the left, and vice versa. Can you eliminate all of the
intersections by making such stretching moves?
Note that, if two of the arrows intersect by pointing into each
other's interior, then no stretching moves can eliminate this
intersection. Call such an intersection "head-to-head". Prove that,
if no two of the original arrows intersect head-to-head, then there is
some set of stretching moves that will eliminate all of the
intersections between all pairs of arrows.
******** Time and place: Dec. 9, 12:30pm in MJ352 (Bldg. 460) ********
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this academic year have
been filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
∂22-Nov-82 2133 Gene Golub <CSD.GOLUB at SU-SCORE> Reminder
Date: 22 Nov 1982 2134-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Reminder
To: Faculty at SU-SCORE
cc: spinrad at PARC-MAXC
Bob Spinrad will be our guest at lunch on Tuesday. Bob is chairman
of the Advisory Committee and this will be a good opportunity to
alert him to some of the department's problems.
GENE
-------
∂23-Nov-82 0905 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@LOGIC.DIS[1,CLT]" at SU-AI
Speaker: Prof. Gerhard Jager, Stanford
Time: Monday, November 29, 3:30-5:00
Place: Room 383N Math. Bldg.
Title: A collapsing function on the ordinals
∂23-Nov-82 1202 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 29 - DECEMBER 3, 1982
Date: 23 Nov 1982 1105-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: COLLOQUIUM NOTICE WEEK OF NOVEMBER 29 - DECEMBER 3, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
11/29/82 Math 380C Ann Greenbaum
Monday Numerical Analysis Lawrence Livermore Laboratory
4:15 p.m. Seminar ``Analysis of a Multigrid Method as an Iterative
Technique for Solving Linear Systems''
11/30/82 MJ352 Dr. Michael Walker
Tuesday Medical Computing Stanford University
1:30 p.m. Journal Club ``Scripts, Conceptual Dependency and FRUMP''
11/30/82 MJ352 Professor Larry Leifer
Tuesday Medical Technology Stanford University
2:30 p.m. Research Seminar ``Robotics in Medicine''
11/30/82 Jordan 040 W. Kahn
Tuesday Computer Science U.C. Berkeley
4:15 p.m. Colloquium ``Mathematics written in sand, the HP15C, INTEL
8087, etc.''
12/1/82 MJ252 Jim McDonald
Wednesday MTC & FORMAL Stanford University
12 p.m. SYSTEMS Seminar To be announced.
12/1/82 Terman Auditorium Fletcher Buckley
Wednesday Computer Systems RCA/Moorestown, N.J.
4:15 p.m. Laboratory Seminar ``Application of Distributed Computers to a Real
Time System''
12/2/82 MJ352 Dr. Maria Klawe
Thursday AFLB IBM Research, San Jose Lab
12:30 p.m. ``Alphabetic Minimax Trees''
12/3/82 MJ352 Francisco Corella, Gary Hendrix
Friday Database Research Symantec
3:15 p.m. Seminar ``Natural Language DBMS for Micro Computers''
-------
∂24-Nov-82 1002 Paul Armer <CSD.ARMER at SU-SCORE> Advisory Committee Agenda
Date: 24 Nov 1982 1000-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Advisory Committee Agenda
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
The agenda for the President's Advisory Committee on Computer Science
and Computing appears in <csd.files>paccsc.agenda. The date is December 1.
Paul
-------
∂24-Nov-82 1028 pratt at Navajo Advisory committee
Mail-from: SU-NET host Navajo rcvd at 24-Nov-82 1028-PST
Date: 24 November 1982 10:28:09-PST (Wednesday)
From: pratt at Navajo
Subject: Advisory committee
To: csd.armer at score
Cc: csd-faculty at score
All in one day? Last year I thought they had a day and a half, or was it
two full days, of presentations, followed by what was to be three hours or so
of committee discussion which ended up being twice that length.
Also, CIT isn't even mentioned. Are they no longer a concern of this
committee? (Your message simply said "The agenda" as opposed to "The agenda
for the non-CIT part.")
-v
∂24-Nov-82 1040 Paul Armer <CSD.ARMER at SU-SCORE> Re: Advisory committee
Date: 24 Nov 1982 1036-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Re: Advisory committee
To: pratt at SU-NAVAJO at SU-SCORE
cc: csd-faculty at SU-SCORE
Stanford-Phone: (415) 497-2906
In-Reply-To: Your message of 24-Nov-82 1028-PST
the committee has been split into two pieces- one for CIT and one for all
the rest. The CIT committee will meet sometime in the future. They will
be around the morning of the second writing their report but there will
not be any open meetings so I didn"t include that portion of the agenda.
Paul
-------
∂24-Nov-82 1058 Vaughan Pratt <pratt at Navajo> Re: Advisory committee
Mail-from: SU-NET host Navajo rcvd at 24-Nov-82 1056-PST
Date: Wednesday, 24 Nov 1982 10:55-PST
To: Paul Armer <CSD.ARMER at SU-SCORE>
Cc: csd-faculty at SU-SCORE
Subject: Re: Advisory committee
In-reply-to: Your message of 24 Nov 1982 1036-PST.
From: Vaughan Pratt <pratt at Navajo>
So CIT is getting to be bigger business than ever at Stanford, achieving
parity with the combination of both research and instructional computing
across two schools as measured by their share of attention from the Advisory
Committee. Ed was mentioning their functioning like a business, we would be
well advised to buy stock in them when they go public.
-v
∂27-Nov-82 0933 CLT MTC and FORMAL SYSTEMS SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. December 1, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Jim McDonald
TITLE: Introducing mathematical notions into mechanical theorem proving,
Coming Events:
Wednesday December 8, Pepe Meseguer, SRI, on OBJ
∂28-Nov-82 1815 Gene Golub <CSD.GOLUB at SU-SCORE> Kahan Colloquium
Date: 28 Nov 1982 1814-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Kahan Colloquium
To: faculty at SU-SCORE
Velvel Kahan of Berkeley will be the speaker on Tuesday. He's always
quite interesting to hear though he goes on at length. After his
talk there will be a dinner at a Chinese restaurant which specializes
in seafood; it is excellent. Mrs. Kahan will also be joinning us.
Please let me know by noon on Tuesday whether you can come for dinner.
The cost is approximately $10 per person.
GENE
-------
∂29-Nov-82 0130 Arthur Keller <ARK at SU-AI> Potluck This Saturday
Mail-from: ARPANET site SU-AI rcvd at 29-Nov-82 0132-PST
Date: 29 Nov 1982 0127-PST
From: Arthur Keller <ARK at SU-AI>
Subject: Potluck This Saturday
To: SU-BBoards at SU-AI
CC: Reid at 10432, CSD.Ahnger at SU-SCORE, Faculty at SU-SCORE
Remember the CSD potluck is this Saturday, December 4 at 6:00 pm at
Brian Reid's house (2960 Waverly St., Palo Alto, 493-6012). Sign up
lists and maps will be available later in the week. Thanks to Brian
for volunteering his house, and to Sally and others on the social
committee for organizing it.
It's time to think about what you want to bring! Come show what you
can cook! Come have one last fling before dead week!
∂29-Nov-82 1420 Paul Armer <CSD.ARMER at SU-SCORE> The President's Advisory Committee on Computer Science and
Date: 29 Nov 1982 1317-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: The President's Advisory Committee on Computer Science and
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
The President' Advisory Committee on Computer Science and Computing
will be here Thursday morning (Dec 2) as well as December 1. They have
9:00 to 10:15 set aside for "Committee Visitations" so one or more of
them might come looking for one of you during that time. If you would like
to bend one of their ears during that time, I would recommend that you
try to make the arrangements for it the previous day. Thursday morning
their meeting room is the first floor seminar room in Margaret Jacks
(I'm told that's a small seminar room and not room 146).Paul
-------
∂29-Nov-82 1532 CSCHMIDT at SUMEX-AIM Chaosnet
Date: 29 Nov 1982 1531-PST
From: CSCHMIDT at SUMEX-AIM
Subject: Chaosnet
To: HPP-Lisp-Machines at SUMEX-AIM
The Chaosnet is still not perfect, but here are a few things to try on the VAX-
chstat reports on diablo's chaosnet hookup (not very useful)
hostat reports on all chaosnet hosts' chaosnet activity
chtime reports the time as given by the specified chaosnet host, i.e.
"chtime lm1" will tell you the time as reported by the Lisp Machine;
"chtime diablo" will tell you what diablo thinks the time is.
chup reports on the uptime of the specified host; similar to chtime.
cftp the file transfer program. Self documenting, but has problems.
/usr/local/src/cmd/chaos/finger is like normal finger, except that
other chaos hosts can be queried. I.e. "/usr/local/src/cmd/chaos/finger @lm1"
will tell you who is logged in on the Lisp Machine (!).
--Christopher
-------
∂29-Nov-82 1746 Gene Golub <CSD.GOLUB at SU-SCORE> Meeting with Wessells and Quate
Date: 29 Nov 1982 1735-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Meeting with Wessells and Quate
To: CSD-Tenured-Faculty: ;
cc: csd.irmgild at SU-SCORE
Just a reminder that we will be meeting with Wessells and Quate at
2PM to discuss SPACE. The meeting will be in the Conference Room
next to my office. GENE
-------
∂30-Nov-82 2153 Gene Golub <CSD.GOLUB at SU-SCORE> meeting on Thursday
Date: 30 Nov 1982 2154-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: meeting on Thursday
To: CSD-Tenured-Faculty: ;
Since this Thursday is the first Thursday of the month, we will be
meeting again. The meeting will take place at 2:30 on Thursday, Dec 2
in the Conference Room next to my office.We need to discuss the
re-appointment of Lantz.
GENE
PS I thought the meeting went pretty well today. I believe our message
is beginning to be understood. I think it'll be good for us to meet after
the Advisory committee visit.
-------
∂30-Nov-82 2220 Gene Golub <CSD.GOLUB at SU-SCORE> Cedar Hall
Date: 30 Nov 1982 2222-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Cedar Hall
To: CSD-Tenured-Faculty: ;
cc: csd.armer at SU-SCORE, CSD.BSCOTT at SU-SCORE
I brought up Cedar Hall again to Wessells tonight. He said he thought the
department would get some of the space there but he was concerned about
the cost of upgrading it. I told him that CIT had left it in pretty
good condition. GENE
-------
∂01-Dec-82 1504 Gene Golub <CSD.GOLUB at SU-SCORE> Cocktail Party
Date: 1 Dec 1982 1348-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Cocktail Party
To: faculty at SU-SCORE
The Advisory Committee is meeting today and tomorrow. There is a
cocktail party today( Wednesday) at the Faculty Club from 6-7pm.
Please drop by if you can. They are a very hard working committee
and it would be helpful to them if they could meet the Faculty. GENE
-------
∂02-Dec-82 0928 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF DECEMBER 6 - 10, 1982
Date: 2 Dec 1982 0828-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: COLLOQUIUM NOTICE WEEK OF DECEMBER 6 - 10, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
12/6/82 Math 380C Lin Qun
Monday Numerical Analysis Academia Sinica
4:15 p.m. Seminar ``The Splitting Extrapolation Method for
Multidimensional Problems''
12/7/82 MJ352 Peter Wang
Tuesday Medical Computing Stanford University
1:30 p.m. Journal Club ``Recent Articles of Interest''
12/7/82 MJ352 Dr. William Clancey
Tuesday Medical Technology Stanford University
2:30 p.m. Research Seminar ``Progress Towards a Computer-Aided Instruction
Program that Teaches Diagnostic Strategies''
12/7/82 MJ252 Hugh Lauer
Tuesday Special Seminar Xerox SDD
2:30 p.m. ``How to Formulate a Thesis Proposal''
12/7/82 Jordan 040 Mark Stickel
Tuesday Computer Science SRI International
4:15 p.m. Colloquium ``A Nonclausal Connection-Graph Resolution
Theorem-Proving Program''
12/8/82 MJ252 Pepe Meseguer
Wednesday MTC & FORMAL SRI International
12 p.m. SYSTEMS Seminar ``On OBJ''
12/9/82 MJ352 Dr. Lyle Ramshaw
Thursday AFLB Xerox
12:30 p.m ``Structuring a program that has GOTO
Statements''
12/10/82 MJ352 Paula Hawthorne
Friday Database Research Lawrence Berkeley Laboratory
3:15 p.m. Seminar ``History and Development of Database Machines''
-------
∂02-Dec-82 2358 Joan Feigenbaum <CSD.JF at SU-SCORE> course evaluations
Date: 2 Dec 1982 2355-PST
From: Joan Feigenbaum <CSD.JF at SU-SCORE>
Subject: course evaluations
To: PHD-Distribution-list: ;
cc: CSD-Faculty: ;
Next week, the course evaluation forms will be handed out in
computer science classes. The course evaluation committee (Peter
Rathmann, Andrei Broder, and myself) needs volunteers to hand out the
forms. The job entails going to the class towards the end of lecture,
making sure the instructor leaves enough time for them to be filled in,
**giving instructions to the class**, collecting the forms when they're
done, and returning them to a committee member. Friday and Monday,
Peter and I will be recruiting volunteers. If you are taking courses,
please help us out by handing out the forms in classes you are still
attending. Mail to csd.jf or csd.rathmann if you're interested.
thanks,
joan
-------
∂04-Dec-82 1139 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@LOGIC.DIS[1,CLT]" at SU-AI
Speaker: Prof. Gerhard Jager, Stanford
Time: Monday, December 6, 3:30-5:00
Place: Room 383N Math. Bldg.
Title: Proof theory of iterated admissible sets
∂05-Dec-82 2048 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 5 Dec 1982 1916-PST
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
AFLB will resume in the second week of January.
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
L A S T A F L B - T A L K T H I S Y E A R
9/12/82 Dr. Lyle Ramshaw (Xerox):
"Structuring a program that has GOTO statements"
A Pascal GOTO can jump either forward or backward within a block, but
a Mesa GOTO can only force an exit from a block. I recently faced the
problem of translating as many types of Pascal GOTO's as possible into
legal Mesa control structures. This problem turns out to suggest the
following puzzle, whose solution I will present.
Draw a horizontal line. Above that line, draw a collection of arrows
connecting pairs of points on the line. Any two of the arrows that
you have drawn must either: (i) be disjoint, (ii) be nested, or (iii)
intersect. Intersecting pairs of arrows are bad. Try to eliminate
them by taking any existing arrow and moving its tail in the direction
that makes the arrow longer. Remember: only tails may move, never
heads. Furthermore, the tail of a right-pointing arrow may only move
to the left, and vice versa. Can you eliminate all of the
intersections by making such stretching moves?
Note that, if two of the arrows intersect by pointing into each
other's interior, then no stretching moves can eliminate this
intersection. Call such an intersection "head-to-head". Prove that,
if no two of the original arrows intersect head-to-head, then there is
some set of stretching moves that will eliminate all of the
intersections between all pairs of arrows.
******** Time and place: Dec. 9, 12:30pm in MJ352 (Bldg. 460) ********
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this academic year have
been filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
∂06-Dec-82 1149 Gene Golub <CSD.GOLUB at SU-SCORE> Lunch on 12/7/82
Date: 6 Dec 1982 1148-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Lunch on 12/7/82
To: faculty at SU-SCORE
Norm Wessells, Dean of H&S, will be joining us this Tuesday for lunch.
He has an appointment at 1 and will be here at noon. Please try to be
on time. GENE
Wessells received his degree from Yale in zoology in 1960.
-------
∂06-Dec-82 1354 CLT MTC and FORMAL SYSTEMS SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. December 8, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Jose Meseguer
PROGRAMMING WITH PARAMETERIZED
ABSTACT OBJECTS IN OBJ
Joseph Goguen, Jose Meseguer
SRI International, Computer Science Lab
Menlo Park CA 94025
and
David Plaisted
University of Illinois
Urbana-Champaign, IL 61801
Abstract:
OBJ is a logic based ultra-high level programming language that has been
strongly influenced by modern programming methodology. In particular, it
provides facilities for user definable abstract data types, parameterized
abstract objects, interactive programming (when the system detects errors, it
provides suitable error messages and puts the user into an edit mode;
execution resumes when editing is completed), libraries, and other features.
OBJ is based on equational logic, rather than on first order logic; because
equations can be interpreted directly as rewrite rules, it is easy to see
their computational significance as well as their logical significanse. OBJ
is so high level that we originally thought of it as a specification language.
However, it is now seems clear that data flow and other innovative
architectures will support very efficient implementations of rewrite rules.
The talk will give an overview of the language and its semantics and report
some experiences with an experimental OBJ implementation
in LISP; in general, this experience encourages our belief that equational
logic based languages are a promising research direction that could have
significant practical impact.
Coming Events:
FRIDAY December 10, 2pm Corrado Bohm, University of Rome
∂06-Dec-82 1401 CLT SPECIAL MTC and FORMAL SYSTEMS SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: FRIDAY December 10, 2pm
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Corrado Bohm, University of Rome
TITLE: Benefiting from Parallel Reductions in Combinatory Logic,
Coming Events:
Christmas Break -- see you in January
If you would like to speak next term, or have a suggestion for
a speaker send a msg to CLT@SU-AI
∂07-Dec-82 1607 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF DECEMBER 13 - 17, 1982
Date: 7 Dec 1982 1441-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: COLLOQUIUM NOTICE WEEK OF DECEMBER 13 - 17, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
12/14/82 MJ352 Dr. Robert Blum
Tuesday Medical Computing Stanford University
1:30 p.m. Journal Club ``A Tutorial on Multiple Regression''
12/14/82 Jordan 040 Robert W. Taylor
Tuesday Computer Science IBM (San Jose)
4:15 p.m. Colloquium ``The 925 Family of Work Stations''
-------
∂08-Dec-82 1230 Paul Armer <CSD.ARMER at SU-SCORE> Space in Cedar Hall
Date: 8 Dec 1982 1224-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Space in Cedar Hall
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
We expect to get some additional space in Cedar Hall in the Jordan Quad
next Spring. If any of you would like to establish an outpost over
there please let me know as soon as possible. Paul
-------
∂08-Dec-82 0941 Chappell at SRI-AI TINLUNCH on Friday
Date: 8 Dec 1982 0942-PST
From: Chappell at SRI-AI
Subject: TINLUNCH on Friday
To: TINlunchers:
cc: chappell, navarro, ichiki, molender
TINLUNCH will be held on Friday December 10, 1982 in EK242 at
lunchtime. Brian Phillips of Texas Instruments will be present
to discuss his recent work on TIME: A TEXTUAL INFORMATION
MANAGEMENT ENVIRONMENT. Copies of a brief statement about this
work and an earlier paper, A MESSAGE-PASSING CONTROL STRUCTURE
FOR TEXT UNDERSTANDING (COLING '82) are available on Elsie's
filing cabinet.
TIME: A Textual Information Management Environment
Brian Phillips
Texas Instruments, Inc.
The TIME project is a plan to develop a system that will provide access
to textual information. Text enters the system through a
text-understanding system that builds a conceptual representation and
extracts key concepts for the document. Access to this knowledge base
at the content (via conceptual structure) and document (via key
concepts) levels is proposed. Finally, a user requires facilities to
extract and manipulate parts of the data to form a personal knowledge
base for the task in hand.
At present only the text understanding and document-level retrieval
facilities are under development.
The text understanding system has a pseudo-parallel, message-passing
control structure to allow syntactic, semantic, and pragmatic
information to be accessed at any point in the analysis. This
communication between components is used to allow ambiguities to be
resolved, as far as possible, as they are encountered. It also permits
the conceptual representation to be built in parallel with the syntactic
analysis and to feed predictions back towards syntax.
The document-level retrieval system uses menu-driven, mouse-selected key
concept specification.
The system is being developed on the text of TI's patent descriptions.
-------
-------
-------
∂09-Dec-82 2204 Gene Golub <CSD.GOLUB at SU-SCORE> Genesereth appointment
Date: 9 Dec 1982 2203-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Genesereth appointment
To: CSD-Tenured-Faculty: ;
We are still having problems with the Genesereth appointment. He
needed to obtain his undergraduate transcipts for his appointment
papers to go forward. Unfortunately, Mike had a very poor record as
an undergraduate and Quate is now holding up the papers claiming
they would never get by the Advisory Committee. Any comments?
GENE
-------
∂12-Dec-82 0222 pratt at Navajo Potluck
Mail-from: SU-NET host Navajo rcvd at 11-Dec-82 2302-PST
Date: 11 December 1982 23:02:25-PST (Saturday)
From: pratt at Navajo
Subject: Potluck
To: csd-faculty at score
Looking forward to seeing you all at the faculty potluck this Saturday. Please
let us know soon if you can come. (Also let me know in case you didn't
receive the hardcopy invitation!)
The map that came with the invitation was a print of a Picasso. The
following cubist impression of a U.S. Coast and Geodetic Survey pen-and-ink
should add a touch of variety to your map collection.
Vaughan
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←| |←←←←←←←←←←←←←←←←←←←←←←←←←←
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←Foothill←←←←←←Light←←←←←←Expressway←←←←←←←←←
Vaughan and Margot Pratt |P|
Street address: 2215 Gerth Lane /.a|.....one way - no entry to
Los Altos Hills //|g| Old Page Mill Road
Phone: 494-2545 // |e|
<PO address: 2215 Old Page Mill Rd. // | |
Palo Alto, CA 94304> Old || |M|
DIRECTIONS Page|| |i|
Take Page Mill to near 280 Mill|| |l|
Follow sign to Old Page Mill Road Road|| |l|
Gerth Lane has row of mailboxes............|| Light←←←←←←←←←←←←←←←←←←←←←←←←←
Park behind mailboxes.................... :|| |E --------------------------
Cross bridge........................... : :|| |x| Deer Creek Road
2215 is second on left....... : : :|| |p|
: : : :|| |w|
Gerth Lane : : : :|| |y| only entry to
=================:=========#=:=:= === .!.....Old Page Mill Road
2215 2209 : M \\ | | and Gerth Lane
<not to scale> :.P \\| |
\ |
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←| |←←←←←←←←←←←←←←←←←←←←←←←←←
←<--SF←←←←←←←←←←←←←←←←←←←←←←Route 280←←←←←←←←←←←← ←←←←←←←←←←←←←←←←←←←←←SJ-->
∂17-Dec-82 0933 Chappell at SRI-AI 1982 Last TINLUNCH
Date: 17 Dec 1982 0932-PST
From: Chappell at SRI-AI
Subject: 1982 Last TINLUNCH
To: TINlunchers:
cc: chappell, navarro, ichiki
TINLUNCH will be held on Friday December 17, 1982 in EK242 at
lunchtime. The paper that will be discussed is
GRAMMARS AS MENTAL REPRESENTATIONS OF LANGUAGE
BY
Joan Bresnan and Ronald M. Kaplan
The author will be present. Copies of this week's presentation
are on Elsie Chappell's file cabinet (EJ251). The next TINLUNCH will
be January 7, 1983.
Note: HAPPY HOLIDAYS !! To one and all.
-------
∂20-Dec-82 0941 Aaai-Office at SUMEX-AIM IJCAI and AAAI Proceedings
Date: 20 Dec 1982 0938-PST
From: Aaai-Office at SUMEX-AIM
Subject: IJCAI and AAAI Proceedings
To: AAAI-DISTRIB:
cc: aaai-office at SUMEX-AIM
Dear Folks,
As mentioned at the Executive Council meeting in Pittsburgh, a
minor goal of ours has been the ability to distribute all IJCAI and
AAAI proceedings from a single source. This is now being done.
IJCAI and AAAI proceedings are now available from:
William Kaufmann, Inc.
95 First Street
Los Altos, CA 94022
(415) 948-5810
The following is the fee schedule agreed upon:
Entire set of nine IJCAI and AAAI proceedings -- 1969 to 1982:
AAAI and IJCAI members: $270.00
Non-members: $340.00
AAAI-82:
Members: $25.00
Non-members: $40.00
IJCAI-81
Members: $25.00
Non-members: $40.00
AAAI-80
Members: $20.00
Non-members: $33.00
IJCAI-79
Members: $25.00
Non-members: $40.00
IJCAI-77
Members: $25.00
Non-members: $40.00
IJCAI-75
Members: $40.00
Non-members: $65.00
IJCAI-73
Members: $40.00
Non-members: $65.00
IJCAI-71
Members: $50.00
Non-members: $80.00
IJCAI-69
Members: $50.00
Non-members: $80.00
-------
∂21-Dec-82 0849 CSCHMIDT at SUMEX-AIM [The Mailer Daemon <Mailer at SUMEX-AIM>: Message of 16-Dec-82 14:53:36]
Date: 21 Dec 1982 0850-PST
From: CSCHMIDT at SUMEX-AIM
Subject: [The Mailer Daemon <Mailer at SUMEX-AIM>: Message of 16-Dec-82 14:53:36]
To: rdg at SU-AI, jmc-lists at SU-AI, rpg at SU-AI
Your mailer rejected this earlier...
---------------
Date: 16 Dec 1982 1500-PST
From: The Mailer Daemon <Mailer at SUMEX-AIM>
To: CSCHMIDT at SUMEX-AIM
Subject: Message of 16-Dec-82 14:53:36
Message failed for the following:
rdg at SU-AI: Sender not given.
JMC-LISTS at SU-AI: Sender not given.
RPG at SU-AI: Sender not given.
------------
Date: 16 Dec 1982 1453-PST
From: CSCHMIDT at SUMEX-AIM
Subject: unix CFTP now working
To: HPP-Lisp-Machines at SUMEX-AIM
I am pleased to announce that we now have a working version of the
unix/Chaosnet file server. You can now "probe" and "directory" as the
help command specifies.
We are using object code from Fairchild, made from source code
identical to that which we had in the first place. Why it compiles
differently in the diablo environment remains to be discovered, but until
then the Fairchild code should serve.
--Christopher
-------
-------
-------
∂21-Dec-82 1024 Aaai-Office at SUMEX-AIM Two Notes
Date: 21 Dec 1982 1021-PST
From: Aaai-Office at SUMEX-AIM
Subject: Two Notes
To: JMC at SU-AI
cc: AAAI-DISTRIB:
For Your Information:
1. Organizational note: Membership in AAAI is now 2,024.
2. I received the following letter, bearing the letterhead for
the European Coordinating Committee for Artificial Intelligence:
Dear Louis Robinson,
Let me inform you that we have set up ECCAI here in Europe in
order to further cooperation in the field of AI.
I think it would be very helpful for both sides if any
information relevant to the other one would be exchanged between
AAAI and ECCAI first hand and as early as possible.
For instance, I would like to inform you that the next European
AI conference, ECAI-84 will take place around Sept. 84 in Pisa
with Tim O'Shea as program Chairman and Stefano Cerri as Local
Arrangements Chairman.
Hoping for good international cooperation in our field,
Yours sincerely,
W. Bibel, Chairman
-------
∂22-Dec-82 1600 CSCHMIDT at SUMEX-AIM sample CFTP session
Date: 22 Dec 1982 1559-PST
From: CSCHMIDT at SUMEX-AIM
Subject: sample CFTP session
To: HPP-Lisp-Machines at SUMEX-AIM
% cftp
cftp>connect lm1 /* you can also connect to diablo! */
cftp>login
Login ID: schmidt
Password: /* carriage return will suffice */
cftp>fdir
Change to foreign directory: >lmsite> /* typically ">yourname>" */
cftp>status
Connected to hpp-lm1.
Logged in as schmidt.
Local directory is "".
Foreign directory is ">lmsite>".
Transfer mode is CHARACTER.
cftp>dir *.* /* note that "dir *" is NOT sufficient */
1 157(8) 11/19/82 16:47:50 ZIPPY >lmsite>HOSTS.TEXT.4
1 572(8) 06/14/82 17:04:14 ACW >lmsite>hosts-example.text.2
1 751(8) 11/19/82 16:50:53 ZIPPY >LMSITE>HSTTBL.LISP.4
1 372(16) 11/19/82 16:51:11 ZIPPY >lmsite>HSTTBL.QFASL.4
1 1055(8) 11/19/82 16:49:50 ZIPPY >LMSITE>LMLOCS.LISP.4
1 231(16) 11/19/82 16:51:16 ZIPPY >lmsite>LMLOCS.QFASL.4
1 988(8) 06/14/82 16:28:09 ACW >lmsite>lmlocs-example.LISP.1
1 1484(8) 11/19/82 17:03:08 ZIPPY >lmsite>site.lisp.7
1 736(16) 11/19/82 17:05:16 ZIPPY >LMSITE>SITE.QFASL.7
2 3972(8) 06/14/82 17:29:18 ACW >lmsite>site-example.LISP.4
1 377(8) 11/19/82 17:05:27 ZIPPY >LMSITE>VERSION.LISP.7
cftp>probe
Probe foreign file: hosts.text
OPEN 4 11/19/82 16:47:50 157 NIL
>lmsite>HOSTS.TEXT.4
cftp>get
Get foreign file: hosts.text
To local file:hosts.text
OPEN 4 11/19/82 16:47:50 157 NIL
>lmsite>HOSTS.TEXT.4
157 bytes in 0.467 seconds = 2.68951 Kbits per second
cftp>quit
% logout
-------
∂22-Dec-82 1612 CSCHMIDT at SUMEX-AIM known Chaosnet inadequacies
Date: 22 Dec 1982 1609-PST
From: CSCHMIDT at SUMEX-AIM
Subject: known Chaosnet inadequacies
To: HPP-Lisp-Machines at SUMEX-AIM
1) If a user attempts to FTP LM1:fileX to HNV:fileY, and LM1:fileX does not
exist, HNV:fileY will be smashed anyway.
2) If a user on the LM-2 runs the file system editor, selects "tree edit any,"
and specifies a directory on the VAX which has any files with the
extension .press or .unfasl, the file system editor will bomb out, tell
you that you have an illegal unix pathname, and dump you in a lisp listener.
3) If a user on the VAX attempts to delete a file on the LM-2 he will find
himself talking to unix again very shortly. The file will not be deleted.
4) CFTP bombs out a lot. It's not your fault.
This list of inadequacies is itself inadequate. If I am not told about others,
the chances that they will be resolved are very unfavorable.
--Christopher
-------